منابع مشابه
STACY: Um Novo Algoritmo para Automaticamente Classificar a Força dos Relacionamentos ao Longo dos Anos
Understanding the relationships between people in a social network and measuring their strength over time are interesting problems with distinct applications. Here, we propose a new algorithm (STACY) to automatically classify tie strength in eight different classes by considering the temporal aspect. Our results show: such classes represent different behaviors, and STACY identifies strong relat...
متن کاملEvolução dos Temas de Interesse do SBBD ao Longo dos Anos
A mineração temporal de textos (temporal text mining TTM) é uma técnica cujo objetivo é descobrir a estrutura latente e padrões temporais em coleções de texto. Estas características são importantes em coleções em que os tópicos de interesse mudam frequentemente com o passar do tempo. Além disso, a mineração temporal de textos é útil em ferramentas de sumarização e descoberta de tendências. Nest...
متن کاملA Mechanism for Detecting and Identifying DoS attack in VANET
VANET (Vehicular Ad-hoc Network) which is a hy- brid network (combination of infrastructure and infra- structure-less networks) is an emergent technology with promising future as well as great challenges especially in security. By the other hand this type of network is very sensible to safety problem. This paper focuses on a new mechanism for DoS (denial of service) attacks on the physical and ...
متن کاملFVIII-VWF dos-à-dos.
In this issue of Blood, back-to-back (dos-à-dos) papers by Chiu et al and Yee et al present complementary findings of structural investigations into the interaction between factor VIII (FVIII) and von Willebrand factor (VWF). The binding of FVIII to VWF contributes in a major way to the regulation of hemostasis.
متن کاملDiierent Capacities of a Digraph Jj Anos Kk Orner
The Shannon capacity of every induced subgraph of a perfect graph equals its clique number. However, for the co{normal powers of an odd cycle the super{multiplicativity of the clique number makes the determination of capacity one of the hardest problems in combinatorics. We study the asymptotic growth of induced subgraphs of some particular type in powers of a xed graph. In case of a simple gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Novos Rumos
سال: 1969
ISSN: 0102-5864
DOI: 10.36311/0102-5864.6.v0n20.2090